Compile-time Copy Elimination

Correctness of Copy in Calculi with Letrec, Case and Constructors

Call-by-need lambda calculi with letrec provide a rewritingbased operational semantics for (lazy) call-by-name functional languages. These calculi model the sharing behavior during evaluation more closely than let-based calculi that use a fixpoint combinator. In a previous paper we showed that the copy-transformation is correct for the small calculus LRλ. In this paper we demonstrate that the p...

Interprocedural Side-Effect Analysis and Optimisation in the Presence of Dynamic Class Loading

We introduce a new approach to computing interprocedural modification side effects for Java programs in the presence of dynamic class loading. When compile-time unknown classes can be loaded dynamically, the pointsto and modification sets computed statically based on the analysed program, called internal world, may be incomplete. Thus, the modification side effects cannot be determined based on...

Compile Time Elimination of Null - and Bounds - Che ksJe

Design and Implementation of a Dynamic Compiler

Compiler optimizations have traditionally focused on optimizing code at compile time [ASU86] , using values available statically (compile-time constants), or predictions of values deduced from profiling runs. Recently [KEH93] [LL96] [APC+96] , however, interest has grown in dynamic compilation, in which code is optimized around values available only at runtime. Dynamic value-based optimizations...

Theorem Prover : A New Exposition and Implementation in Prolog

A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full rst-order predicate calculus. It di ers from Prolog in its use of uni cation with the occurs check for soundness, depthrst iterative-deepening search instead of unbounded depthrst search to make the search strategy complete, and the model elimination reduction rule that is added to Prolog inference...